#include <iostream>
#include <fstream>
#include <cstdio>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <deque>
#include <ctime>
#include <cstdlib>

using namespace std;

#define sz(x) ((int)((x).size()))

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;

ll gcd(ll a, ll b) {
	while (b > 0) {
		a %= b;
		swap(a, b);
	}
	return a;
}

char str[1050];

ll num, den;

int main() {
	//freopen(".in", "r", stdin);
	//freopen(".out", "w", stdout);

	while (scanf("%s", str) == 1) {
		if (str[0] == '#')
			break;
		den = 1;
		int n = strlen(str);
		if (str[n - 1] == 'h') {
			n -= 5;
			num = 0;
		} else {
			n -= 4;
			num = 90;
		}
		int cnt = 1;
		while (n > 0) {
			ll nn = 90;
			ll dd = (1LL << cnt);
			if (str[n - 1] == 'h') {
				num *= dd;
				nn *= den;
				num -= nn;
				den *= dd;
				ll g = gcd(num, den);
				num /= g;
				den /= g;
				n -= 5;
			} else {
				num *= dd;
				nn *= den;
				num += nn;
				den *= dd;
				ll g = gcd(num, den);
				num /= g;
				den /= g;
				n -= 4;
			}
			cnt++;
		}
		if (num > 0) {
			if (den > 1)
				printf("%lld/%lld\n", num, den);
			else
				printf("%lld\n", num);
		} else {
			puts("0");
		}
	}

	return 0;
}
